An Exact Algorithm for Minimum Vertex Cover Problem

An Effective Algorithm for Minimum Weighted Vertex Cover Problem

The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Sup...

A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem

Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. In this paper we have demonstrated that when local optimization technique is added to genetic algorithm to form HGA, it gives near to optimal solution speedy. We have developed new heuristic vertex crossover operator ...

A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem

An original parallel algorithm is presented that stems from a suitable physical metaphor by considering each edge of the graph as a cell that is attracted by the corresponding vertices and finally moves towards the one of them that wins the competition.

An Evolutionary Heuristic for the Minimum Vertex Cover Problem

NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is timeconsuming. Secondly, although...